Modular instantiation schemes
نویسندگان
چکیده
منابع مشابه
Modular instantiation schemes
Instantiation schemes are proof procedures that test the satisfiability of clause sets by instantiating the variables they contain, and testing the satisfiability of the resulting ground set of clauses. Such schemes have been devised for several theories, including fragments of linear arithmetic or theories of data-structures. In this paper we investigate under what conditions instantiation sch...
متن کاملInst-Gen - A Modular Approach to Instantiation-Based Automated Reasoning
Inst-Gen is an instantiation-based reasoning method for first-order logic introduced in [18]. One of the distinctive features of Inst-Gen is a modular combination of first-order reasoning with efficient ground reasoning. Thus, Inst-Gen provides a framework for utilising efficient off-the-shelf propositional SAT and SMT solvers as part of general first-order reasoning. In this paper we present a...
متن کاملPrincipal Type Schemes for Modular Programs
Two of the most prominent features of ML are its expressive module system and its support for Damas-Milner type inference. However, while the foundations of both these features have been studied extensively, their interaction has never received a proper type-theoretic treatment. One consequence is that both the official Definition and the alternative Harper-Stone semantics of Standard ML are di...
متن کاملOn Modular Standard Modules of Association Schemes
We will determine the structure of the modular standard modules of association schemes of class two. In the process, we will give the theoretical interpretation for the p-rank theory for strongly regular graphs, and understand the p-rank as the dimension of a submodule of the modular standard module. Considering the modular standard module, we can obtain the detailed classification more than th...
متن کاملModular Adjacency Algebras of Hamming Schemes
To each association scheme G and to each field R, there is associated naturally an associative algebra, the so-called adjacency algebra RG of G over R. It is well-known that RG is semisimple if R has characteristic 0. However, little is known if R has positive characteristic. In the present paper, we focus on this case. We describe the algebra RG if G is a Hamming scheme (and R a field of posit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2011
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2011.07.003